Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments
نویسندگان
چکیده
منابع مشابه
Arc-Disjoint Paths in Decomposable Digraphs
4 We prove that the weak k-linkage problem is polynomial for every fixed k for totally Φ5 decomposable digraphs, under appropriate hypothesis on Φ. We then apply this and recent results 6 by Fradkin and Seymour (on the weak k-linkage problem for digraphs of bounded independence 7 number or bounded cut-width) to get polynomial algorithms for some class of digraphs like quasi8 transitive digraphs...
متن کاملStrong Tournaments with the Fewest Hamiltonian Paths
Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We characterize the strong tournaments that realize this minimum.
متن کاملDetermining conditions sufficient for the existence of arc-disjoint hamiltonian paths and out-branchings in tournaments
We study problems closely related to the question raised by Bang-Jensen in [1]: When does a tournament a hamiltonian path and out-branching rooted at the same vertex, arc-disjoint from one another? We answer this question under various circumstances, in some cases managing to show that the out-branching can be taken to be path-like or star-like, and in other cases showing that multiple out-bran...
متن کاملDisjoint paths in tournaments
Given k pairs of vertices (si, ti) (1 ≤ i ≤ k) of a digraph G, how can we test whether there exist k vertex-disjoint directed paths from si to ti for 1 ≤ i ≤ k? This is NP-complete in general digraphs, even for k = 2 [2], but for k = 2 there is a polynomial-time algorithm when G is a tournament (or more generally, a semicomplete digraph), due to Bang-Jensen and Thomassen [1]. Here we prove that...
متن کاملEdge-disjoint Hamiltonian Paths and Cycles in Tournaments
We describe sufficient conditions for the existence of Hamiltonian paths in oriented graphs and use these to provide a complete description of the tournaments with no two edge-disjoint Hamiltonian paths. We prove that tournaments with small irregularity have many edge-disjoint Hamiltonian cycles in support of Kelly's conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2021
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2185